EL938 Report: Packet Scheduling
نویسنده
چکیده
Packet scheduling attracted extensive research in the past years since it can significantly improve the performance of many Quality of Service (QoS) control mechanisms, either open-loop control or closed-loop control. In this report, I give the background information behind packet scheduling and a survey of several typical packet scheduling algorithms. After that, a general server model, named latency rate (LR) server, is introduced to analysis the network behavior where all internal nodes are LR servers. Another server model, named rate proportional server (RPS), is also described to give an insight into how the basic elements of a scheduler affect its performance.
منابع مشابه
Cross-layer Packet-dependant OFDM Scheduling Based on Proportional Fairness
This paper assumes each user has more than one queue, derives a new packet-dependant proportional fairness power allocation pattern based on the sum of weight capacity and the packet’s priority in users’ queues, and proposes 4 new cross-layer packet-dependant OFDM scheduling schemes based on proportional fairness for heterogeneous classes of traffic. Scenario 1, scenario 2 and scenario 3 lead r...
متن کاملReview: Fair Scheduling in Wireless Packet Network
A lot of work has been done addressing issues of fair scheduling in wireline packet networks. Most techniques developed have not effectively address the unique constraints post by a wireless packet network. This report reviews [1], a paper which proposes a model for wireless packet network fair scheduling and provides a protocol that attempts to implement such a model.
متن کاملPerformance Evaluation of Variable Packet Size Buffered Crossbar Switches
The crossbar is very popular for the implementation of switches with a moderate number of ports. Unbuffered crossbars (IQ architecture) require complex switch matrix scheduling algorithms that operate on fixed-size cells. On the other hand, buffered crossbars (CICQ architecture), use small buffers at the crosspoints and provide excellent features; scheduling is simplified and variable-size pack...
متن کاملFurther Results in Affinity-Based Scheduling of Parallel Networking
In this paper, we present further results in processor-cache affinity scheduling of parallel network protocol processing, in a setting in which protocol processing executes on the multiprocessor host concurrently with a general workload of non-protocol activity. In earlier work [31, 32] we evaluated affinity-based scheduling of receive-side protocol processing under two parallelization approach...
متن کاملDynamic Global Packet Routing in Wireless Networks
We consider schemes for reuse-eecient packet access in wireless data networks. We show that computing the maximum ergodic packet arrival rate is NP-hard. We give an upper bound on the maximum er-godic throughput in terms of the eigenvalues of matrices related to the path-gain matrix. We present simple, practical heuristic algorithms which exhibit good throughput and packet delay and report on r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002